Belief Revision through Forgetting Conditionals in Conditional Probabilistic Logic Programs

نویسندگان

  • Anbu Yue
  • Weiru Liu
چکیده

In this paper, we present a revision strategy of revising a conditional probabilistic logic program (PLP) when new information is received (which is in the form of probabilistic formulae), through the technique of variable forgetting.We first extend the traditional forgetting method to forget a conditional event in PLPs. We then propose two revision operators to revise a PLP based on our forgetting method. By revision through forgetting, the irrelevant knowledge in the original PLP is retained according to the minimal change principle. We prove that our revision operators satisfy most of the postulates for probabilistic belief revision. A main advantage of our revision operators is that a new PLP is explicitly obtained after revision, since our revision operator performs forgetting a conditional event at the syntax level.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Revision Sequences and Nested Conditionals

The truth conditions for conditional sentences have been well-studied, but few compelling attempts have been made to define means of evaluating iterated or nested conditionals. In particular , most approaches impose very few constraints on the set of conditionals an agent can hold after revision of its belief set. In this paper we describe the method of natural revision that ensures the preserv...

متن کامل

Iterated revision and minimal change of conditional beliefs

We describe a model of iterated belief revision that extends the AGM theory of revision to account for the effect of a revision on the conditional beliefs of an agent. In particular, this model ensures that an agent makes as few changes as possible to the conditional component of its belief set. Adopting the Ramsey test, minimal conditional revision provides acceptance conditions for arbitrary ...

متن کامل

Revision by Conditional Beliefs

Both the dynamics of belief change and the process of reasoning by default can be based on the conditional beZief set of an agent, represented as a set of “if-then” rules. In this paper we address the open problem of formalizing the dynamics of revising this conditional belief set by new if-then rules, be they interpreted as new default rules or new revision policies. We start by providing a pu...

متن کامل

Conditionals, Probability, and Belief Revision (preliminary Version) Conditionals, Probability, and Belief Revision (preliminary Version)*

A famous result obtained in the mid-seventies by David Lewis shows that a straightforward interpretation of probabilities of conditionals as conditional probabilities runs into serious trouble. In this paper we try to circumvent this trouble by defining extensions of probability functions, called conditional probability functions. We further defend the position that rational partial beliefs (ab...

متن کامل

A nonmonotonic conditional logic for belief revision. Part 1: Semantics and logic of simple conditionals

Using Gärdenfors’s notion of epistemic entrenchment, we develop the semantics of a logic which accounts for the following points. It explains why we may generally infer If ¬A then B if all we know is A∨B while must not generally infer If ¬A then B if all we know is {A∨B,A}. More generally, it explains the nonmonotonic nature of the consequence relation governing languages which contain conditio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008